A Better Bound for Locally Thin Set Families
نویسندگان
چکیده
منابع مشابه
A Better Bound for Locally Thin Set Families
A family of subsets of an n-set is 4-locally thin if for every quadruple of its members the ground set has at least one element contained in exactly 1 of them. We show that such a family has at most 2 members. This improves on our previous results with Noga Alon. The new proof is based on a more careful analysis of the self-similarity of the graph associated with such set families by the graph ...
متن کاملLocally Thin Set Families
A family of subsets of an n–set is k–locally thin if for every k of its member sets the ground set has at least one element contained in exactly 1 of them. We derive new asymptotic upper bounds for the maximum cardinality of locally thin set families for every even k. This improves on previous results of two of us with Monti. ∗Research supported in part by a USA Israeli BSF grant and by a grant...
متن کاملA bound for Feichtinger conjecture
In this paper, using the discrete Fourier transform in the finite-dimensional Hilbert space C^n, a class of nonRieszable equal norm tight frames is introduced and using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...
متن کاملA bound for separating hash families
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type.
متن کاملA better upper bound on the number of triangulations of a planar point set
We show that a point set of cardinality n in the plane cannot be the vertex set of more than 59 O(n−6) straight-edge triangulations of its convex hull. This improves the previous upper bound of 276.75n+O(log(n)).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2001
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3162